// The MIT License (MIT)
// Copyright (c) 2017 Thomas Huetter.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

/// \file join/tjoin/set_data.h
///
/// \details
/// Common data stored for each set.

#pragma once

namespace candidate_index {

/// This is an element holding data of a set.
struct SetData {
  /// Overlap so far for a specific set.
  int overlap = 0;
  /// Index prefix for this set to avoid recomputations.
  int prefix = 0;
  /// Constructor.
  SetData();
  /// Constructor.
  SetData(int overlap, int prefix);
};

candidate_index::SetData::SetData() {}

candidate_index::SetData::SetData(int overlap, int prefix)
    : overlap(overlap), prefix(prefix) {}

}
